PDF Document

Source URL: www.mansci.ovgu.de

• Operations research
• Combinatorial optimization
• Packaging
• Discrete geometry
• NP-complete problems
• Knapsack problem
• Bin packing problem
• Packing problem
• Cutting stock problem
• Theoretical computer science
• Computational complexity theory
• Mathematics

Maejo Int. J. Sci. Technol. 2015, 9(01), Maejo International Journal of Science and Technology ISSNAvailable online at www.mijst.mju.ac.th

Source URL: www.mijst.mju.ac.th

• Containers
• Operations research
• Shipping containers
• NP-complete problems
• Discrete geometry
• Packing problem
• Containerization
• Knapsack problem
• Wooden box
• Theoretical computer science
• Computational complexity theory
• Mathematics

Application of POMAC to the Multiobjective 0/1 Knapsack Problem Rié Komuro E. David Ford

Source URL: www.nrcse.washington.edu

Constant Factor Approximation Algorithm for the Knapsack Median Problem Amit Kumar Abstract We give a constant factor approximation algorithm for

Source URL: www.cse.iitd.ernet.in

• Operations research
• Combinatorial optimization
• Relaxation
• Convex optimization
• Linear programming relaxation
• Linear programming
• Knapsack problem
• Randomized algorithm
• Lagrangian relaxation
• Mathematical optimization
• Theoretical computer science
• Applied mathematics

Microsoft PowerPoint - DynamicProgramming.ppt

Source URL: ww3.algorithmdesign.net

• Theoretical computer science
• Dynamic programming
• Mathematical optimization
• Combinatorial optimization
• Equations
• Knapsack problem
• Algorithm
• Matrix multiplication
• Linear programming relaxation
• Mathematics
• Operations research
• Applied mathematics

Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic

Source URL: www.win.tue.nl

• Complexity classes
• Dynamic programming
• NP-complete problems
• Operations research
• P versus NP problem
• Time complexity
• Knapsack problem
• P
• Subset sum problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem Wen-Yang Ku and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toron

Source URL: tidel.mie.utoronto.ca

• Computational complexity theory
• Mathematical optimization
• Constraint programming
• Quadratic programming
• Linear programming
• Semidefinite programming
• Local consistency
• Knapsack problem
• Constraint satisfaction
• Operations research
• Theoretical computer science
• Applied mathematics

Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical

Source URL: lovelace.thi.informatik.uni-frankfurt.de

• Operations research
• Dynamic programming
• NP-complete problems
• Mathematical optimization
• Combinatorics
• Algorithm
• Greedy algorithm
• Knapsack problem
• Longest increasing subsequence
• Mathematics
• Theoretical computer science
• Applied mathematics

Lecture 7 Generate-Test-Aggregate in Coq - NII Lectures Series [width=4cm]niilogo.jpg

Source URL: www.nii.ac.jp

• Mathematics
• Operations research
• Combinatorial optimization
• NP-complete problems
• Windows games
• Knapsack problem
• Semiring
• Grand Theft Auto IV
• Grand Theft Auto V
• Theoretical computer science
• Action-adventure games
• Applied mathematics

Comparison of Parallel Algorithms for the 0-1 Knapsack Problem on Networked Computers Rebecca A Hunt A Thesis in the Field of Information Technology

Source URL: www.rebeccahunt.com

• Operations research
• Knapsack problem
• Algorithm
• Backtracking
• Dynamic programming
• Solver
• Greedy algorithm
• Theoretical computer science
• Applied mathematics
• Mathematics